A Constraint Programming Approach to Scheduling of Malleable Tasks
نویسندگان
چکیده
منابع مشابه
A Constraint Logic Programming Approach to Examination Scheduling
The scheduling of exams in institutions of higher education is a large, highly constrained and complex problem. The recent advent of modularity in many universities has resulted in an increase of the complexity of the problem, making the manual achievement of an acceptable solution a tedious and sometimes almost impossible problem. Examination scheduling is the process of assigning exams to tim...
متن کاملAlgorithms for Scheduling Malleable Cloud Tasks
Due to the ubiquity of batch data processing in cloud computing, the related problem of scheduling malleable batch tasks and its extensions have received significant attention recently. In this paper, we consider a fundamental model where a set of n tasks is to be processed on C identical machines and each task is specified by a value, a workload, a deadline and a parallelism bound. Within the ...
متن کاملMathematical Programming-Based Approach to Scheduling of Communicating Tasks
We present a MILP mathematical programming formulation for static scheduling of dependent tasks onto homogeneous multiprocessor system of an arbitrary architecture with communication delays. We reduce the number of constraints by applying a Reduction Constraint reformulation to the model. We solve several small-scale instances of the reformulated problem by using CPLEX 8.1. Upper bounds are com...
متن کاملScheduling Malleable Tasks on Parallel Processors to Minimize the Makespan
The problem of optimal scheduling n tasks in a parallel processor system is studied. The tasks are malleable, i.e., a task may be executed by several processors simultaneously and the processing speed of a task is a nonlinear function of the number of processors allocated to it. The total number of processors is m and it is an upper bound on the number of processors that can be used by all the ...
متن کاملConstraint Based Scheduling: Applying Constraint Programming to Scheduling Problems
Introducing a new hobby for other people may inspire them to join with you. Reading, as one of mutual hobby, is considered as the very easy hobby to do. But, many people are not interested in this hobby. Why? Boring is the reason of why. However, this feel actually can deal with the book and time of you reading. Yeah, one that we will refer to break the boredom in reading is choosing constraint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networking and Computing
سال: 2019
ISSN: 2185-2839,2185-2847
DOI: 10.15803/ijnc.9.2_131